The sum choice number of P3 Pn
نویسنده
چکیده
A graph G is said to be f -choosable if there exists a proper coloring from every assignment of lists of colors to the vertices of G where the list sizes are given by f . The sum choice number of G is the minimum ∑ v∈V (G) f(v) over all f such that G is f -choosable. Here we determine the sum choice of the cartesian product P3 Pn to be 8n − 3 − bn/3c. The techniques used here have applicability to choosability of other graphs.
منابع مشابه
Bondage number of mesh networks
The bondage number b(G) of a nonempty graph G is the smallest number of edges whose removal from G results in a graph with domination number greater than that of G. Denote Pn × Pm the Cartesian product of two paths Pn and Pm. This paper determines the exact values of b(Pn × P2), b(Pn × P3), and b(Pn × P4) for n 2.
متن کاملSum choice numbers of some graphs
Let f be a function assigning list sizes to the vertices of a graph G. The sum choice number of G is the minimum ∑ v∈V (G) f(v) such that for every assignment of lists to the vertices of G, with list sizes given by f , there exists proper coloring of G from the lists. We answer a few questions raised in a paper of Berliner, Bostelmann, Brualdi, and Deaett. Namely, we determine the sum choice nu...
متن کاملLine completion number of grid graph Pn × Pm
The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...
متن کاملSome new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملThe sum numbers and the integral sum numbers of Cn and Wn
Let G = (V,E) be a simple graph with the vertex set V and the edge set E. G is a sum graph if there exists a labelling f of the vertices of G into distinct positive integers such that uv ∈ E if and only if f(w) = f(u) + f(v) for some vertex w ∈ V . Such a labelling f is called a sum labelling of G. The sum number σ(G) of G is the smallest number of isolated vertices which result in a sum graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 160 شماره
صفحات -
تاریخ انتشار 2012